Well-orderings and finite quantifiers
نویسندگان
چکیده
منابع مشابه
Limited Set quantifiers over Countable Linear Orderings
In this paper, we study several sublogics of monadic secondorder logic over countable linear orderings, such as first-order logic, firstorder logic on cuts, weak monadic second-order logic, weak monadic second-order logic with cuts, as well as fragments of monadic secondorder logic in which sets have to be well ordered or scattered. We give decidable algebraic characterizations of all these log...
متن کاملWell-foundedness of Term Orderings
Well-foundedness is the essential property of orderings for proving termination. We introduce a simple criterion on term orderings such that any term ordering possessing the subterm property and satisfying this criterion is well-founded. The usual path orders fulfil this criterion, yielding a much simpler proof of well-foundedness than the classical proof depending on Kruskal's theorem. Even mo...
متن کاملParamodulation with Well-founded Orderings
For many years, all existing completeness results for KnuthBendix completion and ordered paramodulation required the term ordering ≻ to be well-founded, monotonic and total(izable) on ground terms. Then, it was shown that well-foundedness and the subterm property were enough for ensuring completeness of ordered paramodulation. Here we show that the subterm property is not necessary either. By u...
متن کاملLogic Programs, Well-Orderings, and Forward Chaining
We investigate the construction of stable models of general propositional logic programs. We show that a forward-chaining technique, supplemented by a properly chosen safeguards can be used to construct stable models of logic programs. Moreover, the proposed method has the advantage that if a program has no stable model, the result of the construction is a stable model of a subprogram. Further,...
متن کاملOn the Well Extension of Partial Well Orderings
In this paper, we study the well extension of strict(irreflective) partial well orderings. We first prove that any partially well-ordered structure ⟨A,R⟩ can be extended to a well-ordered one. Then we prove that every linear extension of ⟨A,R⟩ is well-ordered if and only if A has no infinite totally unordered subset under R.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Mathematical Society of Japan
سال: 1968
ISSN: 0025-5645
DOI: 10.2969/jmsj/02030477